Complete intersection toric ideals of oriented graphs and chorded-theta subgraphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ring graphs and complete intersection toric ideals

We study the family of graphs whose number of primitive cycles equals its cycle rank. It is shown that this family is precisely the family of ring graphs. Then we study the complete intersection property of toric ideals of bipartite graphs and oriented graphs. An interesting application is that complete intersection toric ideals of bipartite graphs correspond to ring graphs and that these ideal...

متن کامل

Toric complete intersection codes

In this paper we construct evaluation codes on zero-dimensional complete intersections in toric varieties and give lower bounds for their minimum distance. This generalizes the results of Gold–Little–Schenck and Ballico–Fontanari who considered evaluation codes on complete intersections in the projective space.

متن کامل

Complete Intersections in Toric Ideals

We present examples which show that in dimension higher than one or codimension higher than two, there exist toric ideals IA such that no binomial ideal contained in IA and of the same dimension is a complete intersection. This result has important implications in sparse elimination theory and in the study of the Horn system of partial differential equations.

متن کامل

Matroid Toric Ideals: Complete Intersection, Minors, and Minimal Systems of Generators

In this paper, we investigate three problems concerning the toric ideal associated to a matroid. Firstly, we list all matroids M such that its corresponding toric ideal IM is a complete intersection. Secondly, we handle the problem of detecting minors of a matroidM from a minimal set of binomial generators of IM. In particular, given a minimal set of binomial generators of IM we provide a neces...

متن کامل

Toric Ideals of Integral Closures from Graphs

A graph-theoretic method, simpler than existing ones, is used to characterize the minimal set of monomial generators for the integral closure of any polynomial ring generated by quadratic monomials. The toric ideal of relations between these generators is generated by a set of graphically described binomials. The spectra of the original ring and of its integral closure turn out to be canonicall...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebraic Combinatorics

سال: 2013

ISSN: 0925-9899,1572-9192

DOI: 10.1007/s10801-012-0421-x